#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
typedef long long ll;
int n, a[N];
int zero_cnt = 0, mnzi = 0, mnnz = 0x3f3f3f3f, zi = 0;
bool check(ll x) {
  ll res = 0;
  for (int i = 0; i < n; ++i) {
    if (a[i] < x) res += (x - a[i]);
  }
  return res <= x;
}

int solve() {
  ll l = 0, r = 2e9, ans = l;
  while (l < r) {
    int mid = (l + r) / 2;
    if (check(mid))
      ans = mid, l = mid + 1;
    else
      r = mid;
  }
  return ans;
}

int main() {
  int tc;
  cin >> tc;

  for (int t = 1; t <= tc; ++t) {
    cin >> n;
    for (int i = 0; i < n; ++i) {
      cin >> a[i];
    }

    // cout << solve() + 1 << endl;
    printf("Case #%d: %d\n", t, solve() + 1);
  }
}
